-
1 FFT operation
Англо-русский словарь по компьютерной безопасности > FFT operation
-
2 operation
Англо-русский словарь по компьютерной безопасности > operation
-
3 testing
испытание; испытания; проверка; контроль (см. тж test); тестирование- accelerated testing
- assembly testing
- at-speed testing
- autoranging testing
- beta testing
- bit testing
- black-box testing
- bottom-up testing
- branch testing
- built-in testing
- bulk testing
- burn-in testing
- chip-in-place testing
- clock-rate testing
- cluster testing
- code-based testing
- coincident current testing
- compact testing
- comparison testing
- complete testing
- compliance testing
- computerized testing
- conformance testing
- continuity testing
- core testing
- cross-validation testing
- demonstration testing
- design testing
- development testing
- disruptive testing
- edge-connector testing
- edge-pin testing
- electron-beam testing
- execution testing
- exhaustive pattern testing
- exhaustive testing
- ex-situ testing
- factory testing
- fault isolation testing
- feature testing
- FFT digital testing
- field testing
- file testing
- final testing
- finished testing
- free-race testing
- glass-box testing
- go/no-go testing
- hard testing
- hazardous testing
- in-circuit testing
- in-situ testing
- laissez-faire testing
- manufacturing testing
- margin testing
- module testing
- multipin testing
- nails testing
- near exhaustive testing
- noncoincident current testing
- nondisruptive testing
- normative testing
- on-chip testing
- operation testing
- parallel testing
- parametric testing
- path testing
- performance testing
- plane testing
- prescreening testing
- prescreen testing
- presence testing
- probe testing
- product testing
- production testing
- program testing
- pseudo-exhaustive testing
- random testing
- real-time testing
- redundancy testing
- regression testing
- release testing
- reliability testing
- retrofit testing
- saturation testing
- signature testing
- site testing
- soft testing
- start-small testing
- stimulus/response testing
- stored-response testing
- stress testing
- string testing
- stuck-fault testing
- syndrome testing
- testing normal cases
- testing the exceptions
- testing the extremes
- thread testing
- through-the-pins testing
- top-down testing
- transition count testing
- trial-and-error testing
- unit testing
- white box testingEnglish-Russian dictionary of computer science and programming > testing
См. также в других словарях:
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
Split-radix FFT algorithm — The split radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an obscure paper by R. Yavne (1968) and subsequently rediscovered simultaneously by various authors in… … Wikipedia
Bruun's FFT algorithm — Bruun s algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996 … Wikipedia
Overlap-add method — The overlap add method (OA, OLA) is an efficient way to evaluate the discrete convolution between a very long signal x [n] with a finite impulse response (FIR) filter h [n] ::egin{align}y [n] = x [n] * h [n] stackrel{mathrm{def{=} sum {m=… … Wikipedia
Overlap–add method — The overlap–add method (OA, OLA) is an efficient way to evaluate the discrete convolution of a very long signal x[n] with a finite impulse response (FIR) filter h[n]: where h[m]=0 for m outside the region [1, M]. The concept is to divide the… … Wikipedia
Spectrum analyzer — A spectrum analyzer Spectrum analyzer display A spectrum analyzer measures the magnitude of an input signal versus frequency with … Wikipedia
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
Orthogonal frequency-division multiplexing — Passband modulation v · d · e Analog modulation AM · … Wikipedia
Discrete Hartley transform — A discrete Hartley transform (DHT) is a Fourier related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with analogous applications in signal processing and related fields. Its main distinction from the DFT… … Wikipedia
Convolution — For the usage in formal language theory, see Convolution (computer science). Convolution of two square pulses: the resulting waveform is a triangular pulse. One of the functions (in this case g) is first reflected about τ = 0 and then offset by t … Wikipedia
